Computation of Determinant vs. Permanent A Survey
نویسنده
چکیده
The Determinant vs. Permanent problem has been of particular interest as it gives an example of an “easy” problem, which under some seemingly insignificant alteration becomes vastly more difficult to solve. In sections 2 and 3 I will discuss and prove theorems regarding the complexity of each problem. In section 4 I explore some important combinatorial interpretations of determinant and permanent to point out one of many connections this problem has to other areas of mathematics.
منابع مشابه
Determinant Versus Permanent
We study the problem of expressing permanents of matrices as determinants of (possibly larger) matrices. This problem has close connections to the complexity of arithmetic computations: the complexities of computing permanent and determinant roughly correspond to arithmetic versions of the classes NP and P respectively. We survey known results about their relative complexity and describe two re...
متن کاملGeneralized matrix functions, determinant and permanent
In this paper, using permutation matrices or symmetric matrices, necessary and sufficient conditions are given for a generalized matrix function to be the determinant or the permanent. We prove that a generalized matrix function is the determinant or the permanent if and only if it preserves the product of symmetric permutation matrices. Also we show that a generalized matrix function is the de...
متن کاملBi-polynomial rank and determinantal complexity
The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the determinantal complexity of the d by d permanent polynomial is d/2, due to Mignon and Ressayre in 2004. Inspired by their proof method, we introduce a natural rank ...
متن کاملGeometric Complexity Theory VI: The flip via positivity
Geometric complexity theory (GCT) is an approach towards the P vs. NP and related problems. The article [GCTflip] describes its defining strategy, called the flip, to resolve the self referential paradox, which is the root difficulty in these problems. This article describes an approach based on positivity hypotheses in algebraic geometry and representation theory to implement the flip and ther...
متن کاملPermanent Uncertainty: on the Quantum Evaluation of the Determinant and the Permanent of a Matrix
We investigate the possibility of evaluating permanents and determinants of matrices by quantum computation. All current algorithms for the evaluation of the permanent of a real matrix have exponential time complexity and are known to be in the class P #P. Any method to evaluate or approximate the permanent is thus of fundamental interest to complexity theory. Permanents and determinants of mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016